An Iterative Approach to the Traceability Conjecture for Oriented Graphs
نویسندگان
چکیده
منابع مشابه
An Iterative Approach to the Traceability Conjecture for Oriented Graphs
A digraph is k-traceable if its order is at least k and each of its subdigraphs of order k is traceable. The Traceability Conjecture (TC) states that for k > 2 every k-traceable oriented graph of order at least 2k − 1 is traceable. It has been shown that for 2 6 k 6 6, every k-traceable oriented graph is traceable. We develop an iterative procedure to extend previous results regarding the TC. I...
متن کاملA Traceability Conjecture for Oriented Graphs
A (di)graph G of order n is k-traceable (for some k, 1 ≤ k ≤ n) if every induced sub(di)graph of G of order k is traceable. It follows from Dirac’s degree condition for hamiltonicity that for k ≥ 2 every k-traceable graph of order at least 2k − 1 is hamiltonian. The same is true for strong oriented graphs when k = 2, 3, 4, but not when k ≥ 5. However, we conjecture that for k ≥ 2 every k-tracea...
متن کاملProgress on the Traceability Conjecture for Oriented Graphs
Let's read! We will often find out this sentence everywhere. When still being a kid, mom used to order us to always read, so did the teacher. Some books are fully read in a week and we need the obligation to support reading. What about now? Do you still love reading? Is reading only for you who have obligation? Absolutely not! We here offer you a new book enPDFd progress on the traceability con...
متن کاملThe Path Partition Conjecture for Oriented Graphs
The vertex set and arc set of a digraph D are denoted by V (D) and E (D), respectively, and the number of vertices in a digraph D is denoted by n (D). A directed cycle (path, walk) in a digraph will simply be called a cycle (path, walk). A graph or digraph is called hamiltonian if it contains a cycle that visits every vertex, traceable if it contains a path that visits every vertex, and walkabl...
متن کاملTraceability of k-traceable oriented graphs
A digraph of order at least k is k-traceable if each of its subdigraphs of order k is traceable. We note that 2-traceable oriented graphs are tournaments and for k ≥ 3, k-traceable oriented graphs can be regarded as generalized tournaments. We show that for 2 ≤ k ≤ 6 every k-traceable oriented graph is traceable, thus extending the well known fact that every tournament is traceable. This result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2013
ISSN: 1077-8926
DOI: 10.37236/2498